package problem153;

//153.寻找旋转排序数组中的最小值
//https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/

class Solution {
    public int findMin(int[] nums) {
        int left = 0,right = nums.length-1;
        int x = nums[right];
        while(left<right) {
            int mid = left + (right - left)/2;
            if(nums[mid]>x) left = mid+1;
            else right = mid;
        }
        return nums[left];
    }
}